Aaliation of Authors Key-exchange in Real Quadratic Congruence Function Fields
نویسندگان
چکیده
We show how the theory of real quadratic congruence function elds can be used to produce a secure key distribution protocol. The technique is similar to that advocated by Diie and Hellman in 1976, but instead of making use of a group for its underlying structure, makes use of a structure which is \almost" a group. The method is an extension of the recent ideas of Scheidler, Buchmann and Williams, but, because it is implemented in these function elds, several of the diiculties with their protocol can be eliminated. A detailed description of the protocol is provided, together with a discussion of the algorithms needed to eeect it.
منابع مشابه
Cryptography in Real Quadratic Congruence Function Fields
The Diffie-Hellman key exchange protocol as well as the ElGamal signature scheme are based on exponentiation modulo p for some prime p. Thus the security of these schemes is strongly tied to the difficulty of computing discrete logarithms in the finite field Fp. The Diffie-Hellman protocol has been generalized to other finite groups arising in number theory, and even to the sets of reduced prin...
متن کاملKey-Exchange in Real Quadratic Congruence Function Fields
We show how the theory of real quadratic congruence function fields can be used to produce a secure key distribution protocol. The technique is similar to that advocated by Diffie and Hellman in 1976, but instead of making use of a group for its underlying structure, makes use of a structure which is “almost” a group. The method is an extension of the recent ideas of Scheidler, Buchmann and Wil...
متن کاملElliptic Congruence Function Fields
Recently, the well-known Diie-Hellman key exchange protocol was extended to real quadratic congruence function elds in a non-group based setting. Here, the underlying key space was the set of reduced principal ideals. This set does not possess a group structure, but instead exhibits a so-called infrastructure. The techniques are the same as in the protocol based on real quadratic number elds. A...
متن کاملEquivalences between Elliptic Curves and Real Quadratic Congruence Function Fields
In 1994, the well-known Diie-Hellman key exchange protocol was for the rst time implemented in a non-group based setting. Here, the underlying key space was the set of reduced principal ideals of a real quadratic number eld. This set does not possess a group structure, but instead exhibits a so-called infrastructure. More recently, the scheme was extended to real quadratic congruence function e...
متن کاملComputing discrete logarithms in real quadratic congruence function fields of large genus
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system. The security of this public key system is based on the difficulty of a discrete logarithm problem in these fields. In this paper, we present a probabilistic algorith...
متن کامل